A parameterized family of equilibrium profiles for three-player kuhn poker
نویسندگان
چکیده
This paper presents a parameterized family of equilibrium strategy profiles for three-player Kuhn poker. This family illustrates an important feature of three-player equilibrium profiles that is not present in two-player equilibrium profiles the ability of one player to transfer utility to a second player at the expense of the third player, while playing a strategy in the profile family. This family of strategy profiles was derived analytically and the proof that the members of this family are equilibrium profiles is an analytic one. In addition, the problem of selecting a robust strategy from an equilibrium profile is discussed.
منابع مشابه
Equilibrium solutions of three player Kuhn poker with N>3 cards: A new numerical method using regularization and arc-length continuation
We study the equilibrium solutions of three player Kuhn poker with N > 3 cards. We compute these solutions as a function of the initial pot size, P , using a novel method based on regularizing the system of polynomial equations and inequalities that defines the solutions, and solving the resulting system of nonlinear, algebraic equations using a combination of Newton’s method and arc-length con...
متن کاملMulti-Agent Counterfactual Regret Minimization for Partial-Information Collaborative Games
We study the generalization of counterfactual regret minimization (CFR) to partialinformation collaborative games with more than 2 players. For instance, many 4-player card games are structured as 2v2 games, with each player only knowing the contents of their own hand. To study this setting, we propose a multi-agent collaborative version of Kuhn Poker. We observe that a straightforward applicat...
متن کاملRegret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents
In two-player zero-sum games, if both players minimize their average external regret, then the average of the strategy profiles converges to a Nash equilibrium. For n-player general-sum games, however, theoretical guarantees for regret minimization are less understood. Nonetheless, Counterfactual Regret Minimization (CFR), a popular regret minimization algorithm for extensiveform games, has gen...
متن کاملPoker-CNN: A Pattern Learning Strategy for Making Draws and Bets in Poker Games Using Convolutional Networks
Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker representation. Our poker player learns through iterative self-play, and improves its understanding of the game by training on the results of its previous actions without sophi...
متن کاملPoker-CNN: A Pattern Learning Strategy for Making Draws and Bets in Poker Games
Poker is a family of card games that includes many variations. We hypothesize that most poker games can be solved as a pattern matching problem, and propose creating a strong poker playing system based on a unified poker representation. Our poker player learns through iterative self-play, and improves its understanding of the game by training on the results of its previous actions without sophi...
متن کامل